A multi-stage IP-based heuristic for class timetabling and trainer rostering
نویسندگان
چکیده
منابع مشابه
A multi-stage IP-based heuristic for class timetabling and trainer rostering
We consider an academic timetabling and rostering problem involving periodic retraining of large numbers of employees at an Australian electricity distributor. This problem is different from traditional high-school and university timetabling problems studied in the literature in several aspects. We propose a three-stage heuristic consisting of timetable generation, timetable improvement, and tr...
متن کاملA tensor based hyper-heuristic for nurse rostering
Nurse rostering is a well-known highly constrained scheduling problem requiring assignment of shifts to nurses satisfying a variety of constraints. Exact algorithms may fail to produce high quality solutions, hence (meta)heuristics are commonly preferred as solution methods which are often designed and tuned for specific (group of) problem instances. Hyper-heuristics have emerged as general sea...
متن کاملA column generation-based heuristic for rostering with work patterns
This paper addresses the Ground Crew Rostering Problem with Work Patterns, an important manpower planning problem arising in the ground operations of airline companies. We present a cutting stockbased integer programming formulation of the problem and describe a powerful heuristic decomposition approach, which utilizes column generation and variable fixing, to construct efficient rosters for a ...
متن کاملCase-based heuristic selection for timetabling problems
This paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solvin...
متن کاملCase Based Heuristic Selection for Examination Timetabling
The work presented in this paper could be thought of as a case based hyper-heuristic approach for examination timetabling problems. A hyper-heuristic can be taken to be an automated approach to choose heuristics. Heuristics and meta-heuristics are employed in this capacity in [1] and [2]. In this paper the case-based paradigm is explored as a heuristic selector for examination timetabling probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2015
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-015-2090-3